Incremental Natural{language Processing with Schema{tree Adjoining Grammars
نویسنده
چکیده
منابع مشابه
Negotiation Strategies in an Integrated Natural Language Generation System
This paper describes negotiation strategies in an integrated generation system (INLGS) based on the formalism of Schema–Tree Adjoining Grammars with Unification (SU–TAGs). Integrated or uniformmeans that all knowledge bases are specified in the same formalism and run the same processing algorithm. In our project a reversible parser/generator runs knowledge bases in the formalism of Schema– Tree...
متن کاملIntegrated Natural Language Generation with Schema-Tree Adjoining Grammars
This paper describes an integrated generation system (INLGS) based on the formalism of Schema–Tree Adjoining Grammars with Unification (SU–TAGs). According to this system architecture, all knowledge bases are specified in the same formalism and run the same processing algorithm. A main advantage is that negotiation between generation components can easily be imposed on the system. Moreover, onl...
متن کاملUsing UTAGS for Incremental and Parallel Generation
Exploiting an incremental and parallel processing scheme is useful to improve the performance of natural language generation systems. TAG{GEN is a TAG{based syntactic generator that realizes both principles. It is shown how the demands of incremental and parallel generation innuence the deenition, the design, and the processing of syntactic rules on the basis of Tree Adjoining Grammars.
متن کاملIncremental Generation for Real {
The acceptance of natural language generation systems strongly depends on their capability to facilitate the exchange of information with human users. Current generation systems consider the innuence of situational factors on the content and the form of the resulting utterances. However, the need to time their processing exibly is usually neglected although temporal factors play a central part ...
متن کاملStochastic Categorial Grammars
Statistical methods have turned out to be quite successful in natural language processing. During the recent years, several models of stochastic grammars have been proposed, including models based on lexicalised context-free grammars [3], tree adjoining grammars [15], or dependency grammars [2, 5]. In this exploratory paper, we propose a new model of stochastic grammar, whose originality derive...
متن کامل